SAC and neighbourhood SAC
نویسنده
چکیده
This paper introduces a new kind of local consistency based on the general idea of singleton arc consistency (SAC). This is a reduced form of SAC that only considers neighbourhoods of a variable with a singleton domain; hence, the name “neighbourhood SAC” (NSAC). Like AC and SAC, NSAC has a unique fixpoint, so that NSAC algorithms will produce the same result when applied to a problem regardless of the order in which problem elements are processed. Although NSAC is, of course, dominated by full SAC, on many problems these algorithms produce almost as much filtering with significantly less cost. NSAC can also be incorporated into full search, as a maintained neighbourhood SAC algorithm. The implementation of NSAC has also inspired two new SAC algorithms. One is a full SAC algorithm that is somewhat more efficient than the classical SAC-1 algorithm on many problems and is much easier to code than more advanced versions of SAC. The other is a partial SAC procedure that performs almost as much domain reduction as full SAC, while requiring much less time than full SAC algorithm on some problems. It is, therefore, a possible alternative to restricted SAC-1. These new algorithms are evaluated in experimental tests, together with SAC-1 and three well-known advanced SAC procedures, on a variety of problem classes.
منابع مشابه
Neighbourhood SAC: Extensions and new algorithms
Neighbourhood singleton arc consistency (NSAC) is a type of singleton arc consistency (SAC) in which the subproblem formed by variables adjacent to a variable with a singleton domain is made arc consistent. This paper describes two extensions to neighbourhood SAC. The first is a generalization from NSAC to k-NSAC, where k is the maximum length of the shortest path between the singleton variable...
متن کاملLight-Weight versus Heavy-Weight Algorithms for SAC and Neighbourhood SAC
This paper compares different forms of singleton arc consistency (SAC) algorithms with respect to: (i) their relative efficiency as a function of the increase in problem size and/or difficulty, (ii) the effectiveness with which they can be transformed into algorithms for establishing neighbourhood singleton arc consistency (NSAC) In such comparisons, it was found useful to distinguish two class...
متن کاملApplied Endoscopic Anatomical Evaluation of the Lacrimal Sac
Introduction: Dacryocystorhinostomy (DCR), a popular surgical procedure, has been performed using an endoscopic approach over recent years. Excellent anatomical knowledge is required for this endoscopic surgical approach. This study was performed in order to better evaluate the anatomical features of the lacrimal apparatus from cadavers in the Isfahan forensic center as a sample of the Iranian ...
متن کاملA SURVEY OF 200 DCR OPERATIONS
In a prospective survey, 200 cases of operated chronic dacryocystitis were divided into three groups according to the kind of operation, and the respective results are as follows: Group I includes 100 cases in whom the lacrimal bone was removed (8mm x 8mm) and a 6mm diameter catheter was used (as a duct between the lacrimal sac and nasal cavity). The recurrence rate within one year was 24 ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- AI Commun.
دوره 28 شماره
صفحات -
تاریخ انتشار 2015